587 research outputs found
Reverse mathematics and infinite traceable graphs
This paper falls within the general program of investigating the proof
theoretic strength (in terms of reverse mathematics) of combinatorial
principals which follow from versions of Ramsey's theorem. We examine two
statements in graph theory and one statement in lattice theory proved by
Galvin, Rival and Sands \cite{GRS:82} using Ramsey's theorem for 4-tuples. Our
main results are that the statements concerning graph theory are equivalent to
Ramsey's theorem for 4-tuples over \RCA while the statement concerning
lattices is provable in \RCA.
Revised 12/2010. To appear in Archive for Mathematical Logi
The Complexity of Orbits of Computably Enumerable Sets
The goal of this paper is to announce there is a single orbit of the c.e.
sets with inclusion, \E, such that the question of membership in this orbit
is -complete. This result and proof have a number of nice
corollaries: the Scott rank of \E is \wock +1; not all orbits are
elementarily definable; there is no arithmetic description of all orbits of
\E; for all finite , there is a properly
orbit (from the proof).
A few small corrections made in this versionComment: To appear in the Bulletion of Symbolic Logi
- …